منابع مشابه
2 00 4 Acyclic Heaps of Pieces , Ii
We characterize and classify the " regular classes of heaps " introduced by the author using ideas of Fan and of Stembridge. The irreducible objects fall into five infinite families with one exceptional case.
متن کاملAsymptotic analysis of heaps of pieces and application to timed Petri nets
What is the density of an infinite heap of pieces, if we let pieces fall down randomly, or if we select pieces to maximize the density? How many transitions of a safe timed Petri net can we fire per time unit? We reduce these questions to the computation of the average and optimal case Lyapunov exponents of max-plus automata, and we present several techniques to compute these exponents. First, ...
متن کاملBinomial Heaps and Skew Binomial Heaps
We implement and prove correct binomial heaps and skew binomial heaps. Both are data-structures for priority queues. While binomial heaps have logarithmic findMin, deleteMin, insert, and meld operations, skew binomial heaps have constant time findMin, insert, and meld operations, and only the deleteMin-operation is logarithmic. This is achieved by using skew links to avoid cascading linking on ...
متن کاملVisible acyclic differential nets, Part I: Semantics
We give a geometric condition that characterizes the differential nets having a finitary interpretation in finiteness spaces: visible acyclicity. This is based on visible paths, an extension to differential nets of a class of paths we introduced in the framework of linear logic nets. The characterization is then carried out as follows: the differential nets having no visible cycles are exactly ...
متن کاملTriangular Heaps
In this paper we introduce the triangular heap, a heap with the special property that for every father node its right child (if present) is smaller than its left child. We show how triangular heaps can be applied to the traditional problem of sorting an array in situ in ways quite similar to well-known methods using ordinary heaps. An average case analysis is presented for the construction and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2004
ISSN: 0925-9899
DOI: 10.1023/b:jaco.0000023005.85555.37